Situations from events to proofs
نویسنده
چکیده
String representations of events are applied to Robin Cooper’s proposal that propositions in natural language semantics are types of situations. Links with the higher types of prooftheoretic semantics are forged, deepening type-theoretic interpretations of Discourse Representation Structures to encompass event structures.
منابع مشابه
Identification of Hazardous Situations using Kernel Density Estimation Method Based on Time to Collision, Case study: Left-turn on Unsignalized Intersection
The first step in improving traffic safety is identifying hazardous situations. Based on traffic accidents’ data, identifying hazardous situations in roads and the network is possible. However, in small areas such as intersections, especially in maneuvers resolution, identifying hazardous situations is impossible using accident’s data. In this paper, time-to-collision (TTC) as a traffic conflic...
متن کاملSimilarities and Reuse of Proofs in Formal Software Veriication Similarities and Reuse of Proofs in Formal Software Veriication
The amount of user interaction is a prime cost factor in interactive program veriication. This paper analyzes situations in which the reuse of previous proofs can help reducing these costs. In particular , it describes a technique that reuses subproofs in the veriication of invariants of state transition systems. This technique replays decisions of generalized previous proof attempts from the s...
متن کاملThe logical structures of theological proofs, with an emphasis on the proof of love to God
This article has no abstract.
متن کاملReductions between Cardinal Characteristics of the Continuum
We discuss two general aspects of the theory of cardinal characteristics of the continuum, especially of proofs of inequalities between such characteristics. The first aspect is to express the essential content of these proofs in a way that makes sense even in models where the inequalities hold trivially (e.g., because the continuum hypothesis holds). For this purpose, we use a Borel version of...
متن کاملStructure in Hardware Proofs: First Steps Towards Automation in a Higher-Order Environment
Most proofs of hardware in an higher-order logic environment follow a definite pattern. This observation is used to give a methodology for hardware proofs in order to isolate the situations where the designer’s creativity is required, and to automate the remaining tedious proof tasks. The interactive HOL theorem prover has been extended by generalized hardware specific tactics for simplifying p...
متن کامل